A parallel algorithm for polygon rasterization
نویسندگان
چکیده
منابع مشابه
Parallel Algorithm for Maximum EmptyL - Shaped Polygon ?
For a given rectangle containing N points, an important problem is to nd the largest L-shaped polygon with sides parallel to those of the original rectangle, which contains none of the points. An L-shaped polygon is an orthogonal polygon with exactly one reeex angle. This paper presents a O(log n) time algorithm using O(n 3 = log n) processors on an EREW PRAM, using the idea of parallel preex. ...
متن کاملSpeeding Up Geospatial Polygon Rasterization on GPGPUs
This study targets at speeding up polygon rasterization in large-scale geospatial datasets by utilizing massively parallel General Purpose Graphics Processing Units (GPGPU) computing for efficient spatial indexing and analysis based on a dynamically integrated vector-raster data model. As the first step, we have designed and implemented a parallelization schema for moderately large polygons usi...
متن کاملData-parallel Micropolygon Rasterization
We implement a tile based sort-middle rasterizer in CUDA and study its performance characteristics when used as a backend for adaptive tessellation down to micropolygons. Tessellation and bucketing map very well to the data-parallel paradigm of CUDA, and the majority of time is spent with rasterization. Despite this, our fastest implementation is able to reach 30-50% of the hardware rasterizati...
متن کاملDecoupling Polygon Rendering from Geometry using Rasterization Hardware
The dramatically increasing size of polygonal models resulting from 3D scanning devices and advanced modeling techniques requires new approaches to reduce the load of geometry transfer and processing. In order to supplement methods like polygon reduction or geometry compression we suggest to exploit the processing power and functionality of the rasterization and texture subsystem of advanced gr...
متن کاملSupercover plane rasterization - a rasterization algorithm for generating supercover plane inside a cube
An analysis of a rasterization algorithm for generating supercover planes in 3D voxel space is presented. The derived algorithm is an extension to the classical 2D line rasterization algorithm. Additional voxels needed to form the supercover 3D plane are identified by rasterizing two additional 2D lines per volume slice. A discussion on how to modify the algorithm to rasterize finite supercover...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGGRAPH Computer Graphics
سال: 1988
ISSN: 0097-8930
DOI: 10.1145/378456.378457